Global Complexity is a path-breaking book, which examines how the ideas of chaos and complexity can help us to analyse global processes. Urry argues that there are major advantages in thinking about global processes in this way. The idea of complexity emphasizes that systems are balanced between order and chaos, that a system does not necessarily move towards equilibrium and th...(展开全部)

Global Complexity is a path-breaking book, which examines how the ideas of chaos and complexity can help us to analyse global processes. Urry argues that there are major advantages in thinking about global processes in this way. The idea of complexity emphasizes that systems are balanced between order and chaos, that a system does not necessarily move towards equilibrium and th...(展开全部)

Soaring income inequality and unemployment, expanding populations of the displaced and imprisoned, accelerating destruction of land and water bodies: today’s socioeconomic and environmental dislocations cannot be fully understood in the usual terms of poverty and injustice, according to Saskia Sassen. They are more accurately understood as a type of expulsion—from professional ...(展开全部)

Many aspects of the internal and external workings of computers can be viewed as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It is also often used as an abstract model of other aspects of computation. This book surveys this mathematical theory, concentrating on the question of how much communication i...(展开全部)

Allen B. Downey拥有加州大学伯克利分校的计算机科学博土学位和MIT的硕士与学土学位，现任美国欧林工程学院计算机科学系的教授，曾经在威尔斯利大学、科尔比学院和加州大学伯克利分校教授计算机科学相关的课程。曾经担任 Google的访问科学家，对复杂性科学和Python十分着迷，有较为深入的研究和丰富的实践经验。

This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, an...(展开全部)

Allen B. Downey拥有加州大学伯克利分校的计算机科学博土学位和MIT的硕士与学土学位，现任美国欧林工程学院计算机科学系的教授，曾经在威尔斯利大学、科尔比学院和加州大学伯克利分校教授计算机科学相关的课程。曾经担任 Google的访问科学家，对复杂性科学和Python十分着迷，有较为深入的研究和丰富的实践经验。

This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, an...(展开全部)

尼尔·约翰逊（Neil Johnson），美国乔治·华盛顿大学的物理学教授，他在那里领导了一项将跨学科基础研究与数据科学相结合以解决复杂实际问题的新倡议。在此之前，约翰逊在牛津大学、哥伦比亚大学和迈阿密大学等多个学术机构都担任物理学教授和复杂科学项目负责人。

尼尔·约翰逊（Neil Johnson），美国乔治·华盛顿大学的物理学教授，他在那里领导了一项将跨学科基础研究与数据科学相结合以解决复杂实际问题的新倡议。在此之前，约翰逊在牛津大学、哥伦比亚大学和迈阿密大学等多个学术机构都担任物理学教授和复杂科学项目负责人。